Propagation Path Properties in Iterative Longest-Edge Refinement
نویسندگان
چکیده
In this work we investigate the refinement propagation process in longest-edge based local refinement algorithms for unstructured meshes of triangles. The conformity neighborhood of a triangle, the set of additional triangles that is needed to be refined to ensure mesh conformity is introduced to define the propagation path. We prove that asymptotically the propagation path extends on average to a few neighbor adjacent triangles. We also include numerical evidence which is in complete agreement with the theoretical study reported.
منابع مشابه
Longest-edge algorithms for size-optimal refinement of triangulations
Longest-edge refinement algorithms were designed to iteratively refine the mesh for finite-element applications by maintaining mesh quality (assuring a bound on the smallest angle). In this paper we improve geometrical results on longest-edge refinement algorithms and provide precise bounds on the refinement propagation. We prove that the iterative application of the algorithm gradually reduces...
متن کاملGeometric Properties of the Local Refinement in Unstructured Triangular Meshes
In this work we study the propagation problem due to the conformity process in the longestedge based refinement algorithms for triangular unstructured meshes. The geometric properties in study answers the important question of how the size of the triangulation is affected when local refinement is applied. We prove both theoretically and empirically that the propagation of a single triangle refi...
متن کاملHeuristics for Longest Edge Selection in Simplicial Branch and Bound
Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative refinement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. A range of possibilities arises in higher dimensions where the number of longest edges in a simplex is greater than one. The behaviour of the search and the resulting binary s...
متن کاملWorst Case Complexity of Parallel Triangular Mesh Refinement by Longest Edge Bisection
We present a logarithmic algorithm for performing parallel refinement of triangular meshes by the widely used longest edge bisection procedure. We show that the refinement propagation forms a data dependency which can be expressed as a forest of directed trees. We solve a parallel Euler Tour problem on the trees to propagate the refinement. After propagation, we apply refinement templates. Our ...
متن کاملMultithread Lepp-Bisection Algorithm for Tetrahedral Meshes
Longest edge refinement algorithms were designed to deal with the iterative and local refinement of triangulations for finite element applications. In 3-dimensions the algorithm locally refines a tetredra set Sref and some neighboring tetraedra in each iteration. The new points introduced in the mesh are midpoints of the longest edge of some tetrahedra of either of the input mesh or of some ref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003